-
1 general recursive construction
Математика: общерекурсивное построениеУниверсальный англо-русский словарь > general recursive construction
-
2 general recursive construction
матем.English-Russian scientific dictionary > general recursive construction
-
3 construction
1) сооружение, строительство3) конструкция4) матем. построение5) строение; сооружение6) структура•construction subsidized by public funds — строительство, финансируемое из общественных фондов
constructions on a stereogram — матем. построения на стереографической проекции
См. также в других словарях:
Construction and Analysis of Distributed Processes — Developer(s) the INRIA VASY team Initial release 1986, 24–25 years ago Stable release … Wikipedia
Data General Nova — System Data General Nova 1200 front panel … Wikipedia
Computability theory — For the concept of computability, see Computability. Computability theory, also called recursion theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown … Wikipedia
Recursion theory — Recursion theory, also called computability theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown to include the study of generalized computability… … Wikipedia
Church–Turing thesis — Church s thesis redirects here. For the constructive mathematics assertion, see Church s thesis (constructive mathematics). In computability theory, the Church–Turing thesis (also known as the Church–Turing conjecture, Church s thesis, Church s… … Wikipedia
Laws of Form — (hereinafter LoF ) is a book by G. Spencer Brown, published in 1969, that straddles the boundary between mathematics and of philosophy. LoF describes three distinct logical systems: * The primary arithmetic (described in Chapter 4), whose models… … Wikipedia
Ackermann function — In recursion theory, the Ackermann function or Ackermann Péter function is a simple example of a general recursive function that is not primitive recursive. General recursive functions are also known as computable functions. The set of primitive… … Wikipedia
McCarthy Formalism — In computer science and recursion theory the McCarthy Formalism (1963) of computer scientist John McCarthy clarifies the notion of recursive functions by use of the IF THEN ELSE construction common to computer science, together with the four of… … Wikipedia
Minkowski's question mark function — Minkowski question mark function. ?(x) is on the left and ?(x) x is on the right. In … Wikipedia
Simply typed lambda calculus — The simply typed lambda calculus (lambda^ o) is a typed interpretation of the lambda calculus with only one type combinator: o (function type). It is the canonical and simplest example of a typed lambda calculus. The simply typed lambda calculus… … Wikipedia
Counter machine reference model — The Counter machine s reference model is a set of choices and conventions to be used with the Counter machine and other model variants of the Register machine concept. It permits comparisons between models, and serves a didactic function with… … Wikipedia